منابع مشابه
Mechanized Operational Semantics via (co)induction (preliminary Report)
We give a fully automated description of a small programming language in the theorem prover Isabelle-98. The language syntax and semantics are encoded, and we formally verify a range of semantic properties. This is achieved via uniform (co)inductive methods.
متن کاملRelational Semantics Through Duality
In this paper we show how the classical duality results extended to a Duality via Truth contribute to development of a relational semantics for various modal-like logics. In particular, we present a Duality via Truth for some classes of information algebras and frames. We also show that the full categorical formulation of classical duality extends to a full Duality via Truth.
متن کاملRelational Semantics Revisited
We examine in this paper to what extent at domains containing a `bottom' element, domain constructions such as Plotkin's, and special orderings such as the Egli-Milner ordering or the Smyth ordering can be eschewed (i.e., replaced, respectively, by sets, powersets and the subset relation) in the denotational deenition of the relational semantics of (possibly innnitely) nondeterministic sequenti...
متن کاملRelational Semantics for Modal Logics
Bernd{Holger Schlinglo Institut f ur Informatik, Technische Universitat M unchen, e-mail: [email protected] Wolfgang Heinle Institut f ur angewandte Mathematik, Universitat Bern, e-mail: [email protected] Abstract In this work we survey the connections between modal logic and relation algebra. We compare various modal and relational languages for the speci cation of reac...
متن کاملFunctorial Semantics for Relational Theories
We introduce the concept of Frobenius theory as a generalisation of Lawvere’s functorial semantics approach to categorical universal algebra. Whereas the universe for models of Lawvere theories is the category of sets and functions, or more generally cartesian categories, Frobenius theories take their models in the category of sets and relations, or more generally in cartesian bicategories.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90033-x